On the structure of linear-time reducibility
نویسنده
چکیده
In 1975, Ladner showed that under the hypothesis that P is not equal to NP, there exists a language which is neither in P, nor NP-complete. This result was latter generalized by Schoning and several authors to various polynomial-time complexity classes. We show here that such results also apply to linear-time reductions on RAMs (resp. Turing machines), and hence allow for separation results in linear-time classes similar to Ladner's ones for polynomial time.
منابع مشابه
Cobalt Loading Effects on the Structure and Activity for Fischer-Tropsch and Water-Gas Shift Reactions of Co/Al2O3 Catalysts
An extensive study of Fischer-Tropsch synthesis (FTS) on alumina-supported cobalt catalysts with different amounts of cobalt is reported. Up to 40 wt % of cobalt, is added to the catalysts by impregnation method. The effect of the cobalt loading on the reducibility of the cobalt oxide species, dispersion of the cobalt, average clusters size, water-gas shift (WGS) activity and activity and s...
متن کاملA Modification on Applied Element Method for Linear Analysis of Structures in the Range of Small and Large Deformations Based on Energy Concept
In this paper, the formulation of a modified applied element method for linear analysis of structures in the range of small and large deformations is expressed. To calculate deformations in the structure, the minimum total potential energy principle is used. This method estimates the linear behavior of the structure in the range of small and large deformations, with a very good accuracy and low...
متن کاملPotentials of Evolving Linear Models in Tracking Control Design for Nonlinear Variable Structure Systems
Evolving models have found applications in many real world systems. In this paper, potentials of the Evolving Linear Models (ELMs) in tracking control design for nonlinear variable structure systems are introduced. At first, an ELM is introduced as a dynamic single input, single output (SISO) linear model whose parameters as well as dynamic orders of input and output signals can change through ...
متن کاملEnumeration Reducibility with Polynomial Time Bounds
We introduce polynomial time enumeration reducibility (≤pe) and we retrace Selman’s analysis of this reducibility and its relationship with non deterministic polynomial time conjunctive reducibility. We discuss the basic properties of the degree structure induced by ≤pe over the computable sets and we show how to construct meets and joins. We are thus able to prove that this degree structure is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/cs/0606080 شماره
صفحات -
تاریخ انتشار 2006